resolution theorem proving

См. также в других словарях:

• Automated theorem proving — (ATP) or automated deduction, currently the most well developed subfield of automated reasoning (AR), is the proving of mathematical theorems by a computer program. Decidability of the problem Depending on the underlying logic, the problem of… …   Wikipedia

• Resolution — may refer to: Resolution (audio), a measure of digital audio quality Resolution (logic), a rule of inference used for automated theorem proving Resolution (law), a written motion adopted by a deliberative body Resolution (debate), the statement… …   Wikipedia

• Resolution (logic) — In mathematical logic and automated theorem proving, resolution is a rule of inference leading to a refutation theorem proving technique for sentences in propositional logic and first order logic. In other words, iteratively applying the… …   Wikipedia

• Resolution (Logik) — Die Resolution ist ein Verfahren der formalen Logik, um eine logische Formel auf Gültigkeit zu testen. Das Resolutionsverfahren, auch Resolutionskalkül genannt, ist ein Widerlegungsverfahren: Statt direkt die Allgemeingültigkeit einer Formel zu… …   Deutsch Wikipedia

• Resolution of singularities — Strong desingularization of Observe that the resolution does not stop after the first blowing up, when the strict transform is smooth, but when it is simple normal crossings with the exceptional divisors. In algebraic geometry, the problem of… …   Wikipedia

• Deduction theorem — In mathematical logic, the deduction theorem is a metatheorem of first order logic.[1] It is a formalization of the common proof technique in which an implication A → B is proved by assuming A and then proving B from this assumption.… …   Wikipedia

• Semi-linear resolution — (SLR) is a search strategy (used in the automated theorem prover (ATP) CARINE) that is based on an iteratively deepening depth first search. It is one method used in automated theorem proving.SLR performs linear derivations from the input clauses …   Wikipedia

• Isabelle (theorem prover) — Infobox Software name = Isabelle caption = collapsible = author = developer = released = latest release version = latest release date = latest maintenance version = latest maintenance date = latest preview version = latest preview date =… …   Wikipedia

• SNARK theorem prover — SNARK, SRI s New Automated Reasoning Kit, is a theorem prover for multi sorted first order logic intended for applications in artificial intelligence and software engineering. SNARK s principal inference mechanisms are resolution and… …   Wikipedia

• Fermat's Last Theorem — is the name of the statement in number theory that:: It is impossible to separate any power higher than the second into two like powers,or, more precisely:: If an integer n is greater than 2, then the equation a^n + b^n = c^n has no solutions in… …   Wikipedia

• Sylvester–Gallai theorem — The Sylvester–Gallai theorem asserts that given a finite number of points in the Euclidean plane, either all the points are collinear; or there is a line which contains exactly two of the points. This claim was posed as a problem by J. J.… …   Wikipedia